Modelling of Parallel Unsigned 2n-1 Modular Arithmetic Multiplier for RNS
نویسندگان
چکیده
منابع مشابه
Fast Sign Detection Algorithm for the RNS Moduli Set 2n+1-1, 2n-1, 2n
This brief presents a fast sign detection algorithm for the residue number system moduli set {2n+1 − 1, 2n − 1, 2n}. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new s...
متن کاملMemoryless RNS-to-binary converters for the {2n+1 - 1, 2n, 2n - 1} moduli set
In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...
متن کاملResidue-to-binary arithmetic converter for moduli set {2n -1, 2n, 2n+1, 2n+1 -1}
This paper presents a new reverse converter architecture for the moduli set { 2 -1, 2, 2 +1, 2-1}. It exploits the special properties of the numbers of the form 1 2 ± , and extends the dynamic range of the present triple moduli based systems. Here we use a combination of CRT and MRC for reverse conversion. With a pipelined system the throughput rate is that of a single 3n+1 bit binary adder delay.
متن کاملImproved Modulo (2n+1) Multiplier for IDEA
International Data Encryption Algorithm (IDEA) is one of the most popular cryptography algorithms in date since the characteristic of IDEA is suitable for hardware implementation. This study presents an efficient hardware structure for the modulo (2 + 1) multiplier, which is the most time and space consuming operation in IDEA. The proposed modulo multiplier saves more time and area cost than pr...
متن کاملAn improved RNS reverse converter for the {22n+1-1, 2n, 2n-1} moduli set
In this paper, we propose a novel high speed memoryless reverse converter for the moduli set {22n+1 − 1,2n,2n − 1}. First, we simplify the traditional Chinese Remainder Theorem in order to obtain a reverse converter that only requires arithmetic mod-(22n+1 − 1). Second, we further improve the resulting architecture to obtain a reverse converter that only uses Carry Save Adders and Carry Propaga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2021
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/1084/1/012060